Termination proof of /tmp/tmp4ijwGg/increase4.itrs

Termination of the given ITRSProblem could successfully be proven:

↳ ITRS

  ↳ ITRStoIDPProof

ITRS problem:
The following domains are used:

z

The TRS R consists of the following rules:

f(x, y) → Cond_f(>@z(x, y), x, y)
Cond_f(TRUE, x, y) → f(+@z(x, 1@z), +@z(y, 2@z))

The set Q consists of the following terms:

f(x0, x1)
Cond_f(TRUE, x0, x1)

Added dependency pairs

↳ ITRS

  ↳ ITRStoIDPProof

    ↳ IDP

      ↳ UsableRulesProof

I DP problem:
The following domains are used:

z

The ITRS R consists of the following rules:

f(x, y) → Cond_f(>@z(x, y), x, y)
Cond_f(TRUE, x, y) → f(+@z(x, 1@z), +@z(y, 2@z))

The integer pair graph contains the following rules and edges:

(0): F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0])
(1): COND_F(TRUE, x[1], y[1]) → F(+@z(x[1], 1@z), +@z(y[1], 2@z))

(0) -> (1), if ((x[0] →^* x[1])∧(y[0] →^* y[1])∧(>@z(x[0], y[0]) →^* TRUE))

(1) -> (0), if ((+@z(y[1], 2@z) →^* y[0])∧(+@z(x[1], 1@z) →^* x[0]))

The set Q consists of the following terms:

f(x0, x1)
Cond_f(TRUE, x0, x1)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

↳ ITRS

  ↳ ITRStoIDPProof

    ↳ IDP

      ↳ UsableRulesProof

        ↳ IDP

          ↳ IDPNonInfProof

I DP problem:
The following domains are used:

z

R is empty.
The integer pair graph contains the following rules and edges:

(0): F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0])
(1): COND_F(TRUE, x[1], y[1]) → F(+@z(x[1], 1@z), +@z(y[1], 2@z))

(0) -> (1), if ((x[0] →^* x[1])∧(y[0] →^* y[1])∧(>@z(x[0], y[0]) →^* TRUE))

(1) -> (0), if ((+@z(y[1], 2@z) →^* y[0])∧(+@z(x[1], 1@z) →^* x[0]))

The set Q consists of the following terms:

f(x0, x1)
Cond_f(TRUE, x0, x1)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair F(x, y) → COND_F(>@z(x, y), x, y) the following chains were created:

We consider the chain F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0]) which results in the following constraint:
(1)    (F(x[0], y[0])≥NonInfC∧F(x[0], y[0])≥COND_F(>@z(x[0], y[0]), x[0], y[0])∧(U^Increasing(COND_F(>@z(x[0], y[0]), x[0], y[0])), ≥))

We simplified constraint (1) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2)    ((U^Increasing(COND_F(>@z(x[0], y[0]), x[0], y[0])), ≥)∧0 ≥ 0∧0 ≥ 0)

We simplified constraint (2) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(3)    ((U^Increasing(COND_F(>@z(x[0], y[0]), x[0], y[0])), ≥)∧0 ≥ 0∧0 ≥ 0)

We simplified constraint (3) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(4)    (0 ≥ 0∧(U^Increasing(COND_F(>@z(x[0], y[0]), x[0], y[0])), ≥)∧0 ≥ 0)

We simplified constraint (4) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(5)    (0 = 0∧(U^Increasing(COND_F(>@z(x[0], y[0]), x[0], y[0])), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 ≥ 0)

For Pair COND_F(TRUE, x, y) → F(+@z(x, 1@z), +@z(y, 2@z)) the following chains were created:

We consider the chain F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0]), COND_F(TRUE, x[1], y[1]) → F(+@z(x[1], 1@z), +@z(y[1], 2@z)), F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0]) which results in the following constraint:
(6)    (>@z(x[0], y[0])=TRUE∧+@z(y[1], 2@z)=y[0]1∧y[0]=y[1]∧x[0]=x[1]∧+@z(x[1], 1@z)=x[0]1 ⇒ COND_F(TRUE, x[1], y[1])≥NonInfC∧COND_F(TRUE, x[1], y[1])≥F(+@z(x[1], 1@z), +@z(y[1], 2@z))∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

We simplified constraint (6) using rules (III), (IV) which results in the following new constraint:
(7)    (>@z(x[0], y[0])=TRUE ⇒ COND_F(TRUE, x[0], y[0])≥NonInfC∧COND_F(TRUE, x[0], y[0])≥F(+@z(x[0], 1@z), +@z(y[0], 2@z))∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(8)    (x[0] + -1 + (-1)y[0] ≥ 0 ⇒ (U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥)∧2 + (-1)Bound + (-1)y[0] + x[0] ≥ 0∧0 ≥ 0)

We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(9)    (x[0] + -1 + (-1)y[0] ≥ 0 ⇒ (U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥)∧2 + (-1)Bound + (-1)y[0] + x[0] ≥ 0∧0 ≥ 0)

We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(10)    (x[0] + -1 + (-1)y[0] ≥ 0 ⇒ 2 + (-1)Bound + (-1)y[0] + x[0] ≥ 0∧0 ≥ 0∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

We simplified constraint (10) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(11)    (y[0] ≥ 0 ⇒ 3 + (-1)Bound + y[0] ≥ 0∧0 ≥ 0∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

We simplified constraint (11) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(12)    (y[0] ≥ 0∧x[0] ≥ 0 ⇒ 3 + (-1)Bound + y[0] ≥ 0∧0 ≥ 0∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

(13)    (y[0] ≥ 0∧x[0] ≥ 0 ⇒ 3 + (-1)Bound + y[0] ≥ 0∧0 ≥ 0∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

To summarize, we get the following constraints P_≥ for the following pairs.

F(x, y) → COND_F(>@z(x, y), x, y)
- (0 = 0∧(U^Increasing(COND_F(>@z(x[0], y[0]), x[0], y[0])), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 ≥ 0)
COND_F(TRUE, x, y) → F(+@z(x, 1@z), +@z(y, 2@z))
- (y[0] ≥ 0∧x[0] ≥ 0 ⇒ 3 + (-1)Bound + y[0] ≥ 0∧0 ≥ 0∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))
- (y[0] ≥ 0∧x[0] ≥ 0 ⇒ 3 + (-1)Bound + y[0] ≥ 0∧0 ≥ 0∧(U^Increasing(F(+@z(x[1], 1@z), +@z(y[1], 2@z))), ≥))

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(COND_F(x₁, x₂, x₃)) = 2 + (-1)x₃ + x₂
POL(TRUE) = 0
POL(2@z) = 2
POL(+@z(x₁, x₂)) = x₁ + x₂
POL(FALSE) = -1
POL(F(x₁, x₂)) = 2 + (-1)x₂ + x₁
POL(1@z) = 1
POL(undefined) = -1
POL(>@z(x₁, x₂)) = 1

The following pairs are in P_>:

COND_F(TRUE, x[1], y[1]) → F(+@z(x[1], 1@z), +@z(y[1], 2@z))

The following pairs are in P_bound:

COND_F(TRUE, x[1], y[1]) → F(+@z(x[1], 1@z), +@z(y[1], 2@z))

The following pairs are in P_≥:

F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0])

At least the following rules have been oriented under context sensitive arithmetic replacement:

+@z¹ ↔

↳ ITRS

  ↳ ITRStoIDPProof

    ↳ IDP

      ↳ UsableRulesProof

        ↳ IDP

          ↳ IDPNonInfProof

            ↳ IDP

              ↳ IDependencyGraphProof

I DP problem:
The following domains are used:

z

R is empty.
The integer pair graph contains the following rules and edges:

(0): F(x[0], y[0]) → COND_F(>@z(x[0], y[0]), x[0], y[0])

The set Q consists of the following terms:

f(x0, x1)
Cond_f(TRUE, x0, x1)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.